Module code | WTW 285 |
Qualification | Undergraduate |
Faculty | Faculty of Natural and Agricultural Sciences |
Module content | Setting up and solving recurrence relations. Equivalence and partial order relations. Graphs: paths, cycles, trees, isomorphism. Graph algorithms: Kruskal, Prim, Fleury. Finite state automata. |
Module credits | 12.00 |
NQF Level | 06 |
Programmes |
BSc in Computer Science
BSc in Information Technology in Information and Knowledge Systems BSc in Applied Mathematics BSc in Chemistry BSc in Chemistry 4-year programme BSc in Geography option Geography and Environmental Science BSc in Mathematical Statistics BSc in Mathematics BSc in Mathematics 4-year programme BSc in Physics BSc in Physics 4-year programme |
Service modules | Faculty of Engineering, Built Environment and Information Technology |
Prerequisites | WTW 115 |
Contact time | 2 lectures per week, 1 tutorial per week |
Language of tuition | Module is presented in English |
Department | Mathematics and Applied Mathematics |
Period of presentation | Semester 2 |
Copyright © University of Pretoria 2025. All rights reserved.
Get Social With Us
Download the UP Mobile App